An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Optimal O(log log n) Time Parallel String Matching Algorithm

An optimalO(log log n) time parallel algorithm for string matching on CRCWPRAM is presented. It improves previous results of [G] and [V].

متن کامل

Optimal Parallel algorithm for String Matching on Mesh Network Structure

In this paper we consider the problem of string matching algorithm based on a two-dimensional mesh. This has applications such as string databases, cellular automata and computational biology. The main use of this method is to reduce the time spent on comparisons in string matching by using mesh connected network which achieves a constant time for mismatch a text string and we obtained O(¥. -ti...

متن کامل

An Optimal O(log log N)-Time Parallel Algorithm for Detecting All Squares in a String

An optimal O(loglogn) time concurrent-read concurrent-write parallel algorithm for detecting all squares in a string is presented. A tight lower bound shows that over general alphabets this is the fastest possible optimal algorithm. When p processors are available the bounds become 0(fnl;gnl +loglogrl+p/n12p).

متن کامل

An optimal parallel matching algorithm for cographs

The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. We show that the problem of finding a maximum matching in a cograph can be solved optimally in parallel by reducing it to parenthesis matching. With an $n$-vertex cograph $G$ represented by its parse tree as input, our algorithm finds a maximum matching in...

متن کامل

Derivation of a parallel string matching algorithm

We derive an efficient parallel algorithm to find all occurrences of a pattern string in a subject string in O(log n) time, where n is the length of the subject string. The number of processors employed is of the order of the product of the two string lengths. The theory of powerlists [2, 3] is central to the development of the algorithm and its algebraic manipulations.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Computing

سال: 1990

ISSN: 0097-5397,1095-7111

DOI: 10.1137/0219072